Computation tree logic

Results: 41



#Item
11The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

The Logic in Computer Science Column by Yuri Gurevich Microsoft Research One Microsoft Way, Redmond WA 98052, USA

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2011-09-16 13:09:59
12SSVAn Abstract Specification Language for Static Program Analysis Michael Vistein Frank Ortmeier Wolfgang Reif Lehrstuhl f¨

SSVAn Abstract Specification Language for Static Program Analysis Michael Vistein Frank Ortmeier Wolfgang Reif Lehrstuhl f¨

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2011-08-18 01:13:32
13Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
14Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Fast: a Transducer-Based Language for Tree Manipulation Loris D’Antoni University of Pennsylvania

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2014-03-20 17:09:13
15Equivalences for Fair Kripke Structures Adnan Aziz∗ Robert Brayton‡ Felice Balarin†

Equivalences for Fair Kripke Structures Adnan Aziz∗ Robert Brayton‡ Felice Balarin†

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2005-09-23 01:02:50
16A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking Julien Brunel Damien Doligez

A Foundation for Flow-Based Program Matching Using Temporal Logic and Model Checking Julien Brunel Damien Doligez

Add to Reading List

Source URL: pagesperso-systeme.lip6.fr

Language: English - Date: 2011-12-17 11:26:12
17Theoretical Computer Science – 366 www.elsevier.com/locate/tcs Adapting innocent game models for the B#ohm tree -theory Andrew D. Ker, Hanno Nickau∗ , C.-H. Luke Ong

Theoretical Computer Science – 366 www.elsevier.com/locate/tcs Adapting innocent game models for the B#ohm tree -theory Andrew D. Ker, Hanno Nickau∗ , C.-H. Luke Ong

Add to Reading List

Source URL: www.cs.ox.ac.uk

Language: English - Date: 2006-08-03 11:40:10
18Model-Checking  Overview of Automated Verification SW/HW SW/HW artifact

Model-Checking Overview of Automated Verification SW/HW SW/HW artifact

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2006-02-06 13:57:58
19Logic and Automata over Infinite Trees Der Fakult¨at f¨ ur Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westf¨alischen Technischen Hochschule Aachen

Logic and Automata over Infinite Trees Der Fakult¨at f¨ ur Mathematik, Informatik und Naturwissenschaften der Rheinisch-Westf¨alischen Technischen Hochschule Aachen

Add to Reading List

Source URL: www.automata.rwth-aachen.de

Language: English - Date: 2012-05-29 10:55:56
20Mona & Fido: The Logic-Automaton Connection in Practice Nils Klarlund AT&T Labs{Research Florham Park, NJ

Mona & Fido: The Logic-Automaton Connection in Practice Nils Klarlund AT&T Labs{Research Florham Park, NJ

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2007-03-08 16:49:34